github.com/klauspost/compress/flate.literalNode.literal (field)

60 uses

	github.com/klauspost/compress/flate (current package)
		huffman_code.go#L44: 	literal uint16
		huffman_code.go#L253: 			if e.literal < math.MaxUint16 {
		huffman_code.go#L328: 			h.codes[node.literal] = newhcode(reverseBits(code, uint8(n)), uint8(n))
		huffman_code.go#L361: 			h.codes[node.literal].set(uint16(i), 1)
		huffman_sortByFreq.go#L37: 			if data[i].freq == data[i-6].freq && data[i].literal < data[i-6].literal || data[i].freq < data[i-6].freq {
		huffman_sortByFreq.go#L66: 	for ; a < c && (data[a].freq == data[pivot].freq && data[a].literal < data[pivot].literal || data[a].freq < data[pivot].freq); a++ {
		huffman_sortByFreq.go#L70: 		for ; b < c && (data[pivot].freq == data[b].freq && data[pivot].literal > data[b].literal || data[pivot].freq > data[b].freq); b++ { // data[b] <= pivot
		huffman_sortByFreq.go#L72: 		for ; b < c && (data[pivot].freq == data[c-1].freq && data[pivot].literal < data[c-1].literal || data[pivot].freq < data[c-1].freq); c-- { // data[c-1] > pivot
		huffman_sortByFreq.go#L88: 		if data[pivot].freq == data[hi-1].freq && data[pivot].literal > data[hi-1].literal || data[pivot].freq > data[hi-1].freq { // data[hi-1] = pivot
		huffman_sortByFreq.go#L93: 		if data[b-1].freq == data[pivot].freq && data[b-1].literal > data[pivot].literal || data[b-1].freq > data[pivot].freq { // data[b-1] = pivot
		huffman_sortByFreq.go#L100: 		if data[m].freq == data[pivot].freq && data[m].literal > data[pivot].literal || data[m].freq > data[pivot].freq { // data[m] = pivot
		huffman_sortByFreq.go#L114: 			for ; a < b && (data[b-1].freq == data[pivot].freq && data[b-1].literal > data[pivot].literal || data[b-1].freq > data[pivot].freq); b-- { // data[b] == pivot
		huffman_sortByFreq.go#L116: 			for ; a < b && (data[a].freq == data[pivot].freq && data[a].literal < data[pivot].literal || data[a].freq < data[pivot].freq); a++ { // data[a] < pivot
		huffman_sortByFreq.go#L135: 		for j := i; j > a && (data[j].freq == data[j-1].freq && data[j].literal < data[j-1].literal || data[j].freq < data[j-1].freq); j-- {
		huffman_sortByFreq.go#L147: 	if data[m1].freq == data[m0].freq && data[m1].literal < data[m0].literal || data[m1].freq < data[m0].freq {
		huffman_sortByFreq.go#L151: 	if data[m2].freq == data[m1].freq && data[m2].literal < data[m1].literal || data[m2].freq < data[m1].freq {
		huffman_sortByFreq.go#L154: 		if data[m1].freq == data[m0].freq && data[m1].literal < data[m0].literal || data[m1].freq < data[m0].freq {
		huffman_sortByLiteral.go#L37: 			if data[i].literal < data[i-6].literal {
		huffman_sortByLiteral.go#L70: 		if child+1 < hi && data[first+child].literal < data[first+child+1].literal {
		huffman_sortByLiteral.go#L73: 		if data[first+root].literal > data[first+child].literal {
		huffman_sortByLiteral.go#L101: 	for ; a < c && data[a].literal < data[pivot].literal; a++ {
		huffman_sortByLiteral.go#L105: 		for ; b < c && data[pivot].literal > data[b].literal; b++ { // data[b] <= pivot
		huffman_sortByLiteral.go#L107: 		for ; b < c && data[pivot].literal < data[c-1].literal; c-- { // data[c-1] > pivot
		huffman_sortByLiteral.go#L123: 		if data[pivot].literal > data[hi-1].literal { // data[hi-1] = pivot
		huffman_sortByLiteral.go#L128: 		if data[b-1].literal > data[pivot].literal { // data[b-1] = pivot
		huffman_sortByLiteral.go#L135: 		if data[m].literal > data[pivot].literal { // data[m] = pivot
		huffman_sortByLiteral.go#L149: 			for ; a < b && data[b-1].literal > data[pivot].literal; b-- { // data[b] == pivot
		huffman_sortByLiteral.go#L151: 			for ; a < b && data[a].literal < data[pivot].literal; a++ { // data[a] < pivot
		huffman_sortByLiteral.go#L170: 		for j := i; j > a && data[j].literal < data[j-1].literal; j-- {
		huffman_sortByLiteral.go#L189: 	if data[m1].literal < data[m0].literal {
		huffman_sortByLiteral.go#L193: 	if data[m2].literal < data[m1].literal {
		huffman_sortByLiteral.go#L196: 		if data[m1].literal < data[m0].literal {